in this study, given the sequence dependent setup times, we attempt using the technique of response surface methodology (rsm) to set the parameters of the genetic algorithm (ga), which is used to optimize the scheduling problem of n job on 1 machine (n/1). it aims at finding the most suitable parameters for increasing the efficiency of the proposed algorithm. at first, a central composite desig...

The Single Machine Scheduling with Changeover Costs problem is found in many different workshops. In this case, the main criterion is the sequence-dependent changeover-costs or setup times. This Scheduling problem can be modeled as a Traveling Salesman Problem (TSP) and when time constraints are inserted into the model such as due-dates, the resulting problem is known as the Time Dependent Trav...

This paper deals with the job-shop scheduling problem with sequence-dependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The method is based on iterative solving via branch and bound decisional versions of the problem. At each node of the branch and bound tree, constraint propagation algorithms adapted to setup times are performed for domain f...

This paper introduces and compares several formulations of a production scheduling problem with sequence-dependent and time-dependent setup times on a single machine. The setup time is divided into two parts: one that can be performed at any time and another one that is restricted to be made outside of a given time interval. As a result, the setup time between two jobs is a function of the comp...

This paper addresses the problem of optimizing the scheduling of a production system, using a decentralized heuristic in a parallel machine environment. The proposed algorithm extends the use of the traveling salesman problem for scheduling in single machine models to a multiple machine problem. Here, the algorithm is applied to a complex production environment with time constrains, and its per...

We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set of elementary operations to be processed on different machines. The objective pursued is to minimize the completion time of the set of operations. We investigate a relaxation of the problem related to the traveling salesman pro...

in today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. in this paper, we present a new model for the traveling salesman problem with multiple transporters (tspmt). in the proposed model, which is more applicable than the traditional versions, each city has diffe...

multiple traveling salesman problem (mtsp) is one of the most popular operation research problem and is known as combinatorial optimization problems. mtsp is an extension version of the famous and widely used problem named traveling salesman problem (tsp). because of its benefices in various domains, many researchers have tried to solve that, and many methods have proposed so far. mtsp is a np-...